Partition polytopes over 1-dimensional points
نویسندگان
چکیده
We consider partitions of a finite set whose elements are associated with a single numerical attribute. For each partition we consider the vector obtained by taking the sums of the attributes corresponding to the elements in the parts (sets) of the partition, and we study the convex hulls of sets of such vectors. For sets of all partitions with prescribed number of elements in each set, we obtain a characterizing system of linear inequalities and an isomorphic representation of the face lattice. The relationship of the resulting class of polytopes to that of generalized permutahedra is explored.
منابع مشابه
0 Quadratic forms of rank 1 , closed zones and laminae
For a given lattice, we establish an equivalence involving a closed zone of the corresponding Voronoi polytope, a lamina hyperplane of the corresponding Delaunay partition and a quadratic form of rank 1 being an extreme ray of the corresponding L-type domain. 1991 Mathematics Subject classification: primary 52C07; secondary 11H55 An n-dimensional lattice determines two normal partitions of the ...
متن کاملOn the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice
The following integer analogue of a Radon partition in affine space rd is studied: A partition (S, T) of a set of integer points in ,]d is an integral Radon partition if the convex hulls of S and T have an integer point in common. The Radon number r(d) of an appropriate convexity space on the integer lattice Zd is then the infimum over those natural numbers n such that any set of n points or mo...
متن کاملMinimum Convex Partitions and Maximum Empty Polytopes
Let S be a set of n points in Rd. A Steiner convex partition is a tiling of conv(S) with empty convex bodies. For every integer d, we show that S admits a Steiner convex partition with at most ⌈(n − 1)/d⌉ tiles. This bound is the best possible for points in general position in the plane, and it is best possible apart from constant factors in every fixed dimension d ≥ 3. We also give the first c...
متن کاملSMML estimators for exponential families with continuous sufficient statistics
The minimum message length principle is an information theoretic criterion that links data compression with statistical inference. This paper studies the strict minimum message length (SMML) estimator for d-dimensional exponential families with continuous sufficient statistics, for all d. The partition of an SMML estimator is shown to consist of convex polytopes (i.e. convex polygons when d = 2...
متن کاملProjecting Lattice Polytopes Without Interior Lattice Points
We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d− 1)-dimensional lattice polytope without interior lattice points. This was conjectured by Treutlein. As an immediate corollary, we get a short proof of a recent result of Averkov, Wagner &Weismantel, namely the fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 85 شماره
صفحات -
تاریخ انتشار 1999